Quantum Synchronizable Codes From Augmentation of Cyclic Codes
نویسندگان
چکیده
We propose a new method to construct quantum synchronizable codes from classical cyclic codes using the idea of augmented cyclic codes. The method augments a dual-containing cyclic code C2 to obtain another cyclic codes C1 of higher dimension. The resulting two cyclic codes and the dual code C⊥ 2 satisfy the containing property C⊥ 2 ⊂ C2 ⊂ C1. The proposed construction method based on general quadratic residue sets of size p = 2 − 1, such that the constructed quantum synchronizable codes are Calderbank-Shor-Steane (CSS) quantum error correcting codes. We show that the proposed construction method yield (cl, cr)− [[p+cl+cr, 1]] quantum synchronizable codes that can tolerate maximum number of misalignment errors.
منابع مشابه
Algebraic Quantum Synchronizable Codes
In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of Fujiwara [7] can be generalized to repeated root cyclic codes (RRCCs) such that QSCs are always obtained, which is not the case with simple root cyclic codes. The usefulnes...
متن کاملQuantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available i...
متن کاملAlgebraic techniques in designing quantum synchronizable codes
Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable codes through more extensive use of the theory of finite fields. This makes it possible to widen the range of tolerable magnitude of block synchronization erro...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملOn the construction of statistically synchronizable codes
We consider the problem of constructing statistically synchronizable codes over arbitrary alphabets and for any nite source. We show how to eeciently construct a statistically synchronizable code whose average codeword length is whithin the least likely codeword probability from that of the Huuman code for the same source. Moreover, we give a method for constructing codes having a synchronizing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.6192 شماره
صفحات -
تاریخ انتشار 2014